Some prime factorization results for free quantum group factors
نویسندگان
چکیده
منابع مشابه
M ar 2 00 3 SOME PRIME FACTORIZATION RESULTS FOR TYPE II 1 FACTORS
We prove several unique prime factorization results for tensor products of type II1 factors coming from groups that can be realized either as subgroups of hyperbolic groups or as discrete subgroups of connected Lie groups of real rank 1. In particular, we show that if R⊗LFr1⊗ · · ·⊗LFrm is isomorphic to a subfactor in R⊗LFs1⊗ · · ·⊗LFsn , for some 2 ≤ ri, sj ≤ ∞, then m ≤ n.
متن کاملSOME RESULTS ON STRONGLY PRIME SUBMODULES
Let $R$ be a commutative ring with identity and let $M$ be an $R$-module. A proper submodule $P$ of $M$ is called strongly prime submodule if $(P + Rx : M)ysubseteq P$ for $x, yin M$, implies that $xin P$ or $yin P$. In this paper, we study more properties of strongly prime submodules. It is shown that a finitely generated $R$-module $M$ is Artinian if and only if $M$ is Noetherian and every st...
متن کامل. O A ] 1 9 Fe b 20 03 SOME PRIME FACTORIZATION RESULTS FOR TYPE II 1 FACTORS
We prove several unique prime factorization results for tensor products of type II1 factors coming from groups that can be realized either as subgroups of hyperbolic groups or as discrete subgroups of connected Lie groups of real rank 1. In particular, we show that if R⊗LFr1⊗ · · ·⊗LFrm is isomorphic to a subfactor in R⊗LFs1⊗ · · ·⊗LFsn , for some 2 ≤ ri, sj ≤ ∞, then m ≤ n.
متن کاملPrime Factorization on a Quantum Computer
complete problems eeciently is a Holy Grail of theoretical computer science which very few people expect to be possible on a classical computer. Finding polynomial-time algorithms for solving these problems on a quantum computer would be a momentous discovery. There are some weak indications that quantum computers are not powerful enough to solve NP-complete problems Bennett et al. 1996a], but ...
متن کاملA Note on Shor's Quantum Algorithm for Prime Factorization
It’s well known that Shor[1] proposed a polynomial time algorithm for prime factorization by using quantum computers. For a given number n, he gave an algorithm for finding the order r of an element x (mod n) instead of giving an algorithm for factoring n directly. The indirect algorithm is feasible because factorization can be reduced to finding the order of an element by using randomization[2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal für die reine und angewandte Mathematik (Crelles Journal)
سال: 2017
ISSN: 0075-4102,1435-5345
DOI: 10.1515/crelle-2014-0056